0 Fe b 20 00 Maps of Surface Groups to Finite Groups with No Simple Loops in the Kernel
نویسندگان
چکیده
Let Fg denote the closed orientable surface of genus g. What is the least order finite group, Gg, for which there is a homomorphism ψ : π1(Fg) → Gg so that no nontrivial simple closed curve on Fg represents an element in Ker(ψ)? For the torus it is easily seen that G1 = Z2 × Z2 suffices. We prove here that G2 is a group of order 32 and that an upper bound for the order of Gg is given by g . The previously known upper bound was greater than 2 2g . For any compact surface F there exists a finite group G and a homomorphism ψ : π1(F ) → G such that no nontrivial element in the kernel of ψ can be represented by a simple closed curve. Such a homomorphism is said to have nongeometric kernel. Casson, Gabai, and Skora [5] have each constructed examples of this (see Section 2 for details). The presence of such examples raises a variety of questions relating to the characterization of the finite groups that can occur in this way. This paper addresses the problem of determining the relationship between the genus of F and the order of G. In the case that F is a torus a complete analysis is straightforward. For instance, the natural projection ψ : π1(F ) → H1(F ;Z2) ∼= Z2 ×Z2 has nongeometric kernel. Our first result concerns the genus 2 closed orientable surface, F2. Casson’s construction yields a group of order 2. Skora reduced this order considerably by producing a group of order 2. In Section 3 a group of order 2 = 32, G2, is constructed for which there is a homomorphism ψ2 : π1(F2) → G2 having nongeometric kernel. In Section 4 it is proved that no such example can be constructed using a group of order less than 32. The example in Section 3 is generalized to construct examples for arbitrary genus surfaces in Section 5. The order of the groups constructed is quite small compared to previously constructed examples. As the examples directly generalize the minimal genus 2 example, there is the possibility that they are minimal as well. Acknowledgements Thanks are due to Allan Edmonds for pointing out the proof of Theorem 4.2. The work in Section 5 was motivated by discussions with Dennis Johnson. 1 Notation and Conventions Throughout this paper all surfaces will be closed and orientable. References to basepoints for the fundamental group of a space are omitted. Since the property of being in the kernel of a homomorphism depends only on the conjugacy class of an element, such omissions will not affect the arguments. By a simple loop on a surface we mean an embedding of the circle S . We will say that a homomorphism ψ : π1(F ) → G has geometric kernel if some nontrivial element in the kernel can be represented by a simple loop. Otherwise ψ has nongeometric kernel.
منابع مشابه
Some finite groups with divisibility graph containing no triangles
Let $G$ be a finite group. The graph $D(G)$ is a divisibility graph of $G$. Its vertex set is the non-central conjugacy class sizes of $G$ and there is an edge between vertices $a$ and $b$ if and only if $a|b$ or $b|a$. In this paper, we investigate the structure of the divisibility graph $D(G)$ for a non-solvable group with $sigma^{ast}(G)=2$, a finite simple group $G$ that satisfies the one-p...
متن کاملA ug 2 00 9 Commuting graphs of odd prime order elements in simple groups ∗
We study the commuting graph on elements of odd prime order in finite simple groups. The results are used in a forthcoming paper describing the structure of Bruck loops and Bol loops of exponent 2.
متن کاملSimple groups with the same prime graph as $D_n(q)$
Vasil'ev posed Problem 16.26 in [The Kourovka Notebook: Unsolved Problems in Group Theory, 16th ed.,Sobolev Inst. Math., Novosibirsk (2006).] as follows:Does there exist a positive integer $k$ such that there are no $k$ pairwise nonisomorphicnonabelian finite simple groups with the same graphs of primes? Conjecture: $k = 5$.In [Zvezdina, On nonabelian simple groups having the same prime graph a...
متن کاملar X iv : h ep - t h / 01 11 29 2 v 1 3 0 N ov 2 00 1 Non - Associative Loops for Holger Bech Nielsen February 7 , 2008
Finite groups are of the greatest importance in science. Loops are a simple generalization of finite groups: they share all the group axioms except for the requirement that the binary operation be associative. The least loops that are not themselves groups are those of order five. We offer a brief discussion of these loops and challenge the reader (especially Holger) to find useful applications...
متن کاملClassification of finite simple groups whose Sylow 3-subgroups are of order 9
In this paper, without using the classification of finite simple groups, we determine the structure of finite simple groups whose Sylow 3-subgroups are of the order 9. More precisely, we classify finite simple groups whose Sylow 3-subgroups are elementary abelian of order 9.
متن کامل